Locality Reasoning of Multithreaded Programs through Type Inference
نویسندگان
چکیده
In multithreaded object-oriented programs, locality refers to the dynamic scoping relation among threads and objects in a potentially shared-memory context. This paper calls for type-theoretic investigations into two forms of locality – thread locality and aggregate locality – and proposes a unified type inference algorithm to reason about them over unannotated real-world Java programs.
منابع مشابه
A Type and Effect System for Determinism in Multithreaded Programs
There has been much recent interest in supporting deterministic parallelism in imperative programs. Structured parallel programming models have used type systems or static analysis to enforce determinism by constraining potential interference of lexically scoped tasks. But similar support for multithreaded programming, where threads may be ubiquitously spawned with arbitrary lifetimes, especial...
متن کاملProgramming Parallel Applications in
Cilk (pronounced \silk") is a C-based language for multithreaded parallel programming. Cilk makes it easy to program irregular parallel applications, especially as compared with data-parallel or message-passing programming systems. A Cilk programmer need not worry about protocols and load balancing, which are handled by Cilk's provably eecient runtime system. Many regular and irregular Cilk app...
متن کاملExploiting Locality in
Temporal reasoning with uncertainty about the ordering of events is important in a wide variety of applications. Previous research shows that the associated decision problems are hard even for very restricted cases. In this paper, we investigate using the temporal locality of events and the spatial locality of state spaces to speed inference. We propose a new perspective for representing cause-...
متن کاملMaking a DSM Consistency Protocol Hierarchy-Aware: an Efficient Synchronization Scheme
We consider the design of DSM consistency protocols for hierarchical architectures. Such architectures typically consist of a constellation of loosely-interconnected clusters, each cluster consisting of a set of tightly-interconnected nodes running multithreaded programs. We claim that high performance can only be reached by taking into account this interconnection hierarchy at the very core of...
متن کاملQuantitive studies of data-locality sensitivity on the EARTH multithreaded architecture: preliminary results
Data locality in parallel programs has a major impact on the performance of distributedmemory multiprocessor systems. The reason is that a lower locality increases the latency of memory accesses due to interprocessor communications; thus idling a processor if it has no other tasks to perform. A good data partitioning strategy strives to improve the locality of accesses by grouping data with the...
متن کامل